The Smoothed Number of Pareto-Optimal Solutions in Non-integer Bicriteria Optimization
نویسندگان
چکیده
Pareto-optimal solutions are one of the most important and well-studied solution concepts in multi-objective optimization. Often the enumeration of all Pareto-optimal solutions is used to filter out unreasonable trade-offs between different criteria. While in practice, often only few Pareto-optimal solutions are observed, for almost every problem with at least two objectives there exist instances with an exponential number of Pareto-optimal solutions. To reconcile theory and practice, the number of Pareto-optimal solutions has been analyzed in the framework of smoothed analysis, and it has been shown that the expected value of this number is polynomially bounded for linear integer optimization problems. In this paper we make the first step towards extending the existing results to non-integer optimization problems. Furthermore, we improve the previously known analysis of the smoothed number of Pareto-optimal solutions in bicriteria integer optimization slightly to match its known
منابع مشابه
The Smoothed Number of Pareto Optimal Solutions in Bicriteria Integer Optimization
A well established heuristic approach for solving various bicriteria optimization problems is to enumerate the set of Pareto optimal solutions, typically using some kind of dynamic programming approach. The heuristics following this principle are often successful in practice. Their running time, however, depends on the number of enumerated solutions, which can be exponential in the worst case. ...
متن کاملA provably convergent heuristic for stochastic bicriteria integer programming
We propose a general-purpose algorithm APS (Adaptive Pareto-Sampling) for determining the set of Pareto-optimal solutions of bicriteria combinatorial optimization (CO) problems under uncertainty, where the objective functions are expectations of random variables depending on a decision from a finite feasible set. APS is iterative and population-based and combines random sampling with the soluti...
متن کاملThe Complexity of Nash Equilibria, Local Optima, and Pareto-Optimal Solutions
An instance of a combinatorial optimization problem is usually described by an objective function that is to be optimized over a set of feasible solutions. The decisions that people, companies, and other economic entities face every day are more complex for various reasons: In many situations, there is more than one objective and one is rather interested in finding the most appropriate trade-of...
متن کاملPareto-optimal Solutions for Multi-objective Optimal Control Problems using Hybrid IWO/PSO Algorithm
Heuristic optimization provides a robust and efficient approach for extracting approximate solutions of multi-objective problems because of their capability to evolve a set of non-dominated solutions distributed along the Pareto frontier. The convergence rate and suitable diversity of solutions are of great importance for multi-objective evolutionary algorithms. The focu...
متن کاملSolving Multi-objective Optimal Control Problems of chemical processes using Hybrid Evolutionary Algorithm
Evolutionary algorithms have been recognized to be suitable for extracting approximate solutions of multi-objective problems because of their capability to evolve a set of non-dominated solutions distributed along the Pareto frontier. This paper applies an evolutionary optimization scheme, inspired by Multi-objective Invasive Weed Optimization (MOIWO) and Non-dominated Sorting (NS) strategi...
متن کامل